Quantum complexity of parametric integration
نویسنده
چکیده
We study parametric integration of functions from the class C([0, 1]12) to C([0, 1]1) in the quantum model of computation. We analyze the convergence rate of parametric integration in this model and show that it is always faster than the optimal deterministic rate and in some cases faster than the rate of optimal randomized classical algorithms.
منابع مشابه
Some Results on the Complexity of Numerical Integration
We present some results on the complexity of numerical integration. We start with the seminal paper of Bakhvalov (1959) and end with new results on the curse of dimensionality and on the complexity of oscillatory integrals. This survey paper consists of four parts: 1. Classical results till 1971 2. Randomized algorithms 3. Tensor product problems, tractability and weighted norms 4. Some recent ...
متن کاملMonte Carlo Complexity of Parametric Integration
The Monte Carlo complexity of computing integrals depending on a parameter is analyzed for smooth integrands. An optimal algorithm is developed on the basis of a multigrid variance reduction technique. The complexity analysis implies that our algorithm attains a higher convergence rate than any deterministic algorithm. Moreover, because of savings due to computation on multiple grids, this rate...
متن کاملFast Charge Sensing of a Cavity-Coupled Double Quantum Dot Using a Josephson Parametric Amplifier
We demonstrate fast readout of a double quantum dot (DQD) that is coupled to a superconducting resonator. Utilizing a parametric amplifier beyond its range of linear amplification, we improve the signalto-noise ratio (SNR) by a factor of 2000 compared to the situation with the parametric amplifier turned off. With an integration time of 400 ns comparable to the inverse effective bandwidth, we a...
متن کاملOptimizing Teleportation Cost in Multi-Partition Distributed Quantum Circuits
There are many obstacles in quantum circuits implementation with large scales, so distributed quantum systems are appropriate solution for these quantum circuits. Therefore, reducing the number of quantum teleportation leads to improve the cost of implementing a quantum circuit. The minimum number of teleportations can be considered as a measure of the efficiency of distributed quantum systems....
متن کاملComplexity of Banach space valued and parametric integration
We study the complexity of Banach space valued integration. The input data are assumed to be r-smooth. We consider both definite and indefinite integration and analyse the deterministic and the randomized setting. We develop algorithms, estimate their error, and prove lower bounds. In the randomized setting the optimal convergence rate turns out to be related to the geometry of the underlying B...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Complexity
دوره 20 شماره
صفحات -
تاریخ انتشار 2004